A Survey on Compositional Veri cation

نویسنده

  • Hong Peng
چکیده

In this survey, we overview several compositional veriication approaches based on model checking, namely compositional minimization, classic assume guarantee reasoning and circular reasoning. We describe details of each of these approaches, and elaborate the general problems with some proposed solutions. We also summarize the advantages and disadvantages of each. In the last section, we give a general conclusion for future directions of compositional veriication. Through the analysis, we discuss how the notions of preorder and abstraction play an important role in the reasoning 1. Finally, we will see some new trends in the development of compositional veriication methodologies, e.g., the integration of theorem proving and model checking approaches in the compositional reasoning context. 1 Compositional reasoning is the core technique of compositional veriication. In this paper, compositional reasoning will be used in some places to mean compositional veriication.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Minimal Separating DFA's for Compositional Veri cation

Algorithms for learning a minimal separating DFA of two disjoint regular languages have been proposed and adapted for di erent applications. One of the most important applications is learning minimal contextual assumptions in automated compositional veri cation. We propose in this paper an e cient learning algorithm, called L , that learns and generates a minimal separating DFA. Our algorithm h...

متن کامل

Speci cation and Veri cation of High - Speed Transfer Protocols

Composition of high-speed protocols from basic protocol mechanisms can help to realize the exible application-speci c selection of protocols. For the purpose of formal speci cation, functional modelling, analysis, and veri cation of composed protocols we apply L. Lamport's Temporal Logic of Actions (TLA). We propose a modular and compositional style of speci cation, which supports the analysis ...

متن کامل

Model Checking and Modular Veri cation

We describe a framework for compositional veri cation of nite state processes The framework is based on two ideas a subset of the logic CTL for which satisfaction is preserved under composition and a preorder on structures which captures the relation between a component and a system containing the component Satisfaction of a formula in the logic corresponds to being below a particular structure...

متن کامل

Compositional Speci cation and Veri cation ofHigh - Speed Transfer

Transfer protocols are composed from basic protocol mechanisms and accordingly a complex protocol can be veriied by a series of relatively simple mechanism proofs. Our approach applies L. Lamport's Temporal Logic of Actions (TLA). It is based on a modular compositional TLA-style and supports the analysis of exibly conngured high-speed transfer protocols.

متن کامل

Proof of a Real { Time Mutual Exclusion Protocol K

In this paper, we apply a compositional proof technique to an automatic veri cation of the correctness of Fischer's mutual exclusion protocol. It is demonstrated that the technique may avoid the state{ explosion problem. Our compositional technique has recently been implemented in a tool CMC 5 , which veri es the protocol for 50 processes within 172.3 seconds and using only 32MB main memory. In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998